Closure Polynomials for Strips of Tetrahedra
نویسندگان
چکیده
A tetrahedral strip is a tetrahedron-tetrahedron truss where any tetrahedron has two neighbors except those in the extremes which have only one. Unless any of the tetrahedra degenerate, such a truss is rigid. In this case, if the distance between the strip endpoints is imposed, any rod length in the truss is constrained by all the others to attain discrete values. In this paper, it is shown how to characterize these values as the roots of a closure polynomial whose derivation requires surprisingly no other tools than elementary algebraic manipulations. As an application of this result, the forward kinematics of two parallel platforms with closure polynomials of degree 16 and 12 is straightforwardly solved.
منابع مشابه
Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes
The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G) euv nu (e) nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملun 2 00 3 Counting Lattice Points by means of the Residue Theorem 1
We use the residue theorem to derive an expression for the number of lattice points in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart polynomial. We show that it is a polynomial in t, where t is the integral dilation parameter. We prove the Ehrhart-Macdonald reciprocity law for these tetrahedra,...
متن کاملComputing Roots of Systems of Polynomials by Linear Clipping
We present an algorithm which computes all roots of a given bivariate polynomial system within a given rectangular domain. In each step, we construct the best linear approximants with respect to the L norm and use them to define planar strips enclosing the zero sets of the two polynomials. Since both polynomials are described by their Bernstein-Bézier representations, the computation of these s...
متن کاملOptimal closure of surgical wounds in forefoot surgery: are adhesive strips beneficial?
A subcuticular suture is an ideal closure method of surgical wounds where the aim is healing by primary intention. The addition of adhesive strips over the subcuticular suture appears to be based on anecdotal, rather than experimental evidence. We performed a prospective study to compare the postoperative wound complications of combination closure with subcuticular closure alone. The wounds of ...
متن کامل